Upper bounds for gcd ( u − 1 , v − 1 ) , u , v S - units , generalisations and applications ( joint works with Zannier )
نویسنده
چکیده
Let a > b > 1 be integers. We proved that if bn−1 divides an−1 infinitely often, then a is a power of b. In a joint work with Bugeaud, we also proved that the inequality gcd(an−1, bn−1) ¿ exp(2n) holds for large n, whenever a, b are multiplicatively independent. This fact has been generalised to an analogue inequality where an, bn are replaced by arbitrary S-units in a number field; we also dispose of an extension to function fields. We shall show several applications to these inequalities, both to arithmetic and to algebraic geometry, as well as formal relations to recent results by Noguchi, Winkelmann and Yamanoi in Nevanlinna Theory.
منابع مشابه
2 2 A pr 2 00 4 A lower bound for the height of a rational function at S - unit points Pietro
Abstract. Let a, b be given multiplicatively independent positive integers and let ǫ > 0. In a recent paper written jointly also with Y. Bugeaud we proved the upper bound exp(ǫn) for gcd(a − 1, b − 1); shortly afterwards we generalized this to the estimate gcd(u− 1, v − 1) < max(|u|, |v|), for multiplicatively independent S-units u, v ∈ Z. In a subsequent analysis of those results it turned out...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملOn (Semi-) Edge-primality of Graphs
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملPD-prime cordial labeling of graphs
vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...
متن کامل